Euclidean algorithm - PDFSEARCH.IO - Document Search Engine

Euclidean algorithm
Results: 423

#	Item
291	A Computational Introduction to Number Theory and Algebra (Version 1) Victor Shoup This PDF document contains hyperlinks, and one may navigate through it Add to Reading List Source URL: shoup.net Language: English - Date: 2005-01-20 09:16:20 Finite fields Polynomials Modular arithmetic Computer algebra Group theory Prime number Euclidean algorithm Discrete logarithm Quadratic residue Mathematics Algebra Abstract algebra
292	Errata: A Computational Introduction to Number Theory and Algebra (Version 1) Last updated: [removed]Preface p. xiii: Line 1. Insert “a” after “also”. [VS, [removed]] Add to Reading List Source URL: shoup.net Language: English - Date: 2007-11-10 09:10:03 Public-key cryptography Electronic commerce RSA Prime number Partition Euclidean algorithm Mathematics Integer sequences Number theory
293	DISTINCT UNIT GENERATED TOTALLY COMPLEX QUARTIC FIELDS LAJOS HAJDU1 AND VOLKER ZIEGLER2 Abstract. The problem of characterization of rings whose elements can be expressed as sums of their units has a long history, and is Add to Reading List Source URL: finanz.math.tu-graz.ac.at Language: English - Date: 2012-09-03 02:01:20 Algebraic number theory Field theory Euclidean algorithm Cubic field Discriminant Tensor product of fields Algebraic number field Algebraic integer Closed and exact differential forms Abstract algebra Algebra Mathematics
294	THE NUMBER OF PRIME DIVISORS OF A PRODUCT OF CONSECUTIVE INTEGERS R. BALASUBRAMANIAN, SHANTA LAISHRAM, T. N. SHOREY, AND R. THANGADURAI Abstract. It is shown under Schinzel’s Hypothesis that for a given ` ≥ 1, there Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2008-12-29 04:12:04 Number theory Coprime Chinese remainder theorem Prime number Arithmetic function Euclidean algorithm Mathematics Modular arithmetic Abstract algebra
295	Products of Fibonacci numbers with indices in an interval and at most four omitted being a power Florian Luca Instituto de Matem´aticas Universidad Nacional Aut´onoma de M´exico Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2009-11-19 05:25:39 Fibonacci number Prime number Coprime Euclidean algorithm Binomial coefficient Mathematics Integer sequences Number theory
296	ISSN[removed]Research Reports on Mathematical and Computing Sciences Add to Reading List Source URL: xagawa.net Language: English - Date: 2010-01-23 11:51:07 Statistics Learning with errors Normal distribution Multivariate random variable Proof of knowledge Commitment scheme Lattice problem Vector space Euclidean algorithm Algebra Mathematics Cryptography
297	COMPUTING THE RAMANUJAN TAU FUNCTION DENIS XAVIER CHARLES We show that the Ramanujan Tau function τ(n) can be computed by a randomized algorithm 1 that runs in time O(n 2 + ) for every > 0 under GRH. The same method Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2009-07-16 15:38:35 Analytic number theory Arithmetic function Elliptic functions Randomized algorithm Expectation–maximization algorithm Euclidean algorithm Mathematical analysis Mathematics Modular forms
298	International Journal «Information Theories and Applications» 1 EVOLUTIONARY TECHNIQUE OF SHORTER ROUTE DETERMINATION OF FIRE BRIGADE FOLLOWING TO FIRE PLACE WITH THE OPTIMIZED SPACE OF Add to Reading List Source URL: artint.com.ua Language: English - Date: 2012-12-06 19:29:07 Abstract algebra Mathematical optimization Operations research Matrix Genetic algorithm Vector space Euclidean vector Algebra Mathematics Linear algebra
299	Algebra & Number Theory[removed]A. Baker Department of Mathematics, University of Glasgow. E-mail address: [removed] Add to Reading List Source URL: www.maths.gla.ac.uk Language: English - Date: 2009-01-12 04:29:28 Multiplicative functions Ring theory Greatest common divisor Euclidean algorithm Divisor Arithmetic function Coprime Ring Order Mathematics Abstract algebra Number theory
300	THOUGHTS ON CHEAPER NON-SECRET ENCRYPTION M J Williamson, 10 August[removed]Introduction This note is mainly a much-delayed response to some calculations made on the speed and cost of the equipment to implement non-secre Add to Reading List Source URL: cryptocellar.web.cern.ch Language: English - Date: 1999-02-19 10:14:01 Polynomial Fast Fourier transform Euclidean algorithm Primitive polynomial Multiplication Finite fields Multiplication algorithm Finite field arithmetic Mathematics Abstract algebra Algebra

UPDATE